Lowering security overhead in link state routing
نویسندگان
چکیده
Security services in routing protocols are at the same time very important and very costly. This paper examines the cost of security in link state routing and develops techniques for eecient and secure processing of link state updates. Diierent approaches are recommended for stable and volatile network environments. Applications to mobile ad hoc networks are also considered.
منابع مشابه
Improving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملTrust-based Multipoint Relay Selection Algorithm for Enhancing Security in Mobile Adhoc Networks
Optimized Link State Routing (OLSR) is a in a popular proactive routing protocol for providing peer-to-peer transmissions in mobile ad hoc networks (MANETs). Since sensitive data are communicated in MANET, security remains a major issue. In this paper, we propose a trust based Multipoint Relay (MPR) selection algorithm for defending a specific type of denial-of-service (DOS) attack called node ...
متن کاملAnalysis of Packet Dropping Algorithm in Optimized Link State Routing Protocol (OLSR) in MANET
A mid this last decade, network systems have encountered solid development because of their capacity to give an extra and reciprocal backing for existing infrastruc-ture correspondence frameworks. In such a system, switches should be altered for short (e.g. open security arrangement) or long (e.g. system administrator augmentation) period. This relative solidness of foundation makes proactive d...
متن کاملDistributed QoS Routing Using Bounded Flooding
Quality-of-Service (QoS) routing is indispensable to real-time applications in integrated services packet-switching networks. However, existing QoS-routing schemes based on either request ooding or link-state dissemination are ineecient in terms of message overhead and/or operational cost. This paper proposes a QoS-routing algorithm with bounded ooding which not only dramatically reduces messag...
متن کاملDistributed QoS Routing with Bounded Flooding for Real-Time Applications
Quality-of-Service (QoS) routing is indispensable to real-time applications on integrated services packet-switching networks. However, existing QoS-routing schemes based on either request ooding or link-state dissemination are not e cient in terms of their message overhead and/or operational cost. This paper proposes a QoS-routing algorithm with bounded ooding which not only dramatically reduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 31 شماره
صفحات -
تاریخ انتشار 1999